The Steiner bi-objective shortest path problem

In this paper, we introduce the Steiner Bi-objective Shortest Path Problem. This problem is defined on a directed graph G=(V,A), with subset T?V of terminals. Arcs are labeled travel time and cost. The goal to find complete set efficient paths between every pair nodes in T. motivation behind stems from data preprocessing for vehicle routing problems. We propose solution method based labeling approach multi-objective A* search strategy guiding towards Computational results instances generated real road networks show efficiency proposed algorithm compared state-of-art approaches.